箭(弹)级间螺栓法兰连接结构冲击失效实验与数值仿真

基于火箭(导弹)级间螺栓法兰连接结构,简化设计并制作了一组原理性实验件,利用ABAQUS软件建立有限元模型,设计并进行了多次落锤冲击失效实验,其中包括轴向和横向两种工况,考虑了螺栓均布与非均布、螺栓直径和螺栓-栓孔间隙等不同结构特点。实验过程中采集了螺栓力时程响应数据、柱段关键点应变时程响应数据、锤头冲击力和冲击速度及连接界面开缝位移等多组数据。根据实验效果和实测数据,分析了连接结构冲击失效机理,并对比验证发现有限元模型数值模拟效果和精度与实验结果吻合较好。研究结论可为箭(弹)级间连接结构抗冲击设计提供参考。     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

某空降型自行火炮着陆过程车体损伤评估

为了考核某空降型自行火炮着陆冲击过程的抗冲击振动性能,实装空投试验是检验手段之一,但是实装空投需要耗费巨大的人力和财力,而且试验条件不可控,因此,采用数值模拟分析是一条有效的途径。通过建立整炮的虚拟样机模型获取载荷,建立车体的有限元模型并对车体进行瞬态响应分析,得到车体着陆冲击过程的动应力和动应变,结合勒梅特损伤模型对车体的损伤量进行了计算。这种结合虚拟样机技术和有限元分析的研究方法可为大型空降武器的抗冲击振动试验提供参考。     

The effectiveness of the longest delivery time rule for the flow shop delivery time problem

In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

双层柱壳的流固耦合模态计算与试验研究

采用结构有限元和内域流体有限元的流固耦合计算方法,对球壳及其内域流体进行有限元离散计算,并将计算所得的模态振动频率与理论结果进行了比较.采用同样的方法,进一步对加筋双层圆柱壳进行了流固耦合的复特征值分析,并求解了其固有频率和振型.试验分别对双层柱壳充水和不充水情况下模态和模态频率进行了测量,结果证实了数值计算方法的正确性.     

Capacity investment decisions under risk aversion

This article studies the optimal capacity investment problem for a risk‐averse decision maker. The capacity can be either purchased or salvaged, whereas both involve a fixed cost and a proportional cost/revenue. We incorporate risk preference and use a consumption model to capture the decision maker's risk sensitivity in a multiperiod capacity investment model. We show that, in each period, capacity and consumption decisions can be separately determined. In addition, we characterize the structure of the optimal capacity strategy. When the parameters are stationary, we present certain conditions under which the optimal capacity strategy could be easily characterized by a static two‐sided (s, S) policy, whereby, the capacity is determined only at the beginning of period one, and held constant during the entire planning horizon. It is purchased up to B when the initial capacity is below b, salvaged down to Σ when it is above σ, and remains constant otherwise. Numerical tests are presented to investigate the impact of demand volatility on the optimal capacity strategy. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 218–235, 2016     

一种直线段匹配的新方法

直线特征在人造目标和环境中普遍存在,直线段的匹配是三维重建等应用领域的首要解决问题.一般单直线的匹配方法难以解决被部分遮挡直线的匹配问题,提出了一种基于极线约束和RANSAC算法的匹配方法.对直线段上的点运用基于极线约束的匹配方法在另一幅图像中进行点的同名匹配,采用RANSAC算法建立直线模型,剔除野值,得到匹配直线段.本方法能有效地解决图像中被部分遮挡直线段的匹配问题,仿真实验和实际图像实验证实了本算法的正确性和高精度.     

基于复合左右手传输线90°移相器的设计

复合左右手传输线的提出在无线通讯领域将有很大的应用前景,也为微波传输线和微波元件的设计提供了一种新思路.根据复合左右手传输线的相位特性及频带展宽原理设计了一个90°移相器,该移相器理论上可以实现L波段从f_1到f_2的90°移相.相对带宽为31%,工作频带内的绝对误差在±3°以内.仿真结果表明,基于复合左右手传输线的90°移相器能够实现宽带内的移相,且效果比较明显.实际电路也比较吻合仿真电路,达到理想的要求.     

两种捆绑火箭弹性振动建模方法对比分析及其对姿控系统的影响

针对长助推和短助推两种类型捆绑火箭的不同模态特点,分析了两者弹性振动建模方法的区别和联系,在此基础上建立了某型固体捆绑火箭姿态动力学新模型,模型中基于有限元法导出了弹性振动方程,基于该模型对箭体复杂弹性振动引起的通道间耦合进行了研究,采用逆Nyquist阵列法进行设计。结果表明,该模型能更准确地反映捆绑火箭纵、横、扭耦合运动特性;新模型三通道之间存在弹性耦合,但耦合矩阵具有对角优势性质,采用逆Nyquist阵列法进行姿控系统设计是有效的,仿真结果表明设计的控制器可行,能够取得比较好的性能。     

基于差分进化算法的铁磁物体磁化率优化方法

针对工程中铁磁物体磁化率难以确定的问题,以单元表面积分铁磁物体感应磁场模型为基础,利用磁场测量值建立了多维磁化率数学优化模型,并运用具有全局多维寻优能力的进化差分算法对多维磁化率数学模型进行了求解,进而确定了铁磁物体的感应磁场分布。最后,设计了空心圆筒磁测实验,实验结果表明:该方法能有效获取铁磁物质多维磁化率,还能精确计算铁磁物体的感应磁场分布。